Portuguese Analysis with Tree Adjoining Grammars
نویسندگان
چکیده
2his arlicle approaches aynlactical amdysis of t~orluguese language based upon afimmafsm called Tree Adjoining (;;zmmtarv (7'A( ;, 9 /.I()SttI 85 /. It briefly describes the.fi)rmaOsm and its main operalir#~s, out/i/les a ]'orluguese sttbset .fi)r ana@vis, am/ presents a pcms'er developed according 7~(is concepls it* order io ~¢di&tle an appOcalion of lhe.fi~lvnaO.wn .fi)r this language.
منابع مشابه
PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملMultiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars
Strong lexicalization is the process of turning a grammar generating trees into an equivalent one, in which all rules contain a terminal leaf. It is known that tree adjoining grammars cannot be strongly lexicalized, whereas the more powerful simple context-free tree grammars can. It is demonstrated that multiple simple context-free tree grammars are as expressive as multi-component tree adjoini...
متن کاملExtraction of Tree Adjoining Grammars from a Treebank for Korean
We present the implementation of a system which extracts not only lexicalized grammars but also feature-based lexicalized grammars from Korean Sejong Treebank. We report on some practical experiments where we extract TAG grammars and tree schemata. Above all, full-scale syntactic tags and well-formed morphological analysis in Sejong Treebank allow us to extract syntactic features. In addition, ...
متن کاملA Direct Link between Tree-Adjoining and Context-Free Tree Grammars
The tree languages of tree-adjoining grammars are precisely those of linear monadic context-free tree grammars. Unlike the original proof, we present a direct transformation of a tree-adjoining grammar into an equivalent linear monadic context-free tree grammar.
متن کاملState-Split for Hypergraphs with an Application to Tree Adjoining Grammars
In this work, we present a generalization of the state-split method to probabilistic hypergraphs. We show how to represent the derivational stucture of probabilistic tree-adjoining grammars by hypergraphs and detail how the generalized state-split procedure can be applied to such representations, yielding a state-split procedure for tree-adjoining grammars.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994